On a Well-behaved Relational Generalisation of Rough Set Approximations
نویسنده
چکیده
We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by Samanta and Chakraborty in their recent paper [P. Samanta and M.K. Chakraborty. Interface of rough set systems and modal logics: A survey. Transactions on Rough Sets XIX, pages 114-137, 2015].
منابع مشابه
Rough ideals based on ideal determined varieties
The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...
متن کاملUsing generalised Łukasiewicz’s t-norm to represent and improve fuzzy rough approximations
Triangular norms are a generalisation of the classical two-valued conjunction. They were originally introduced for definition of the probabilistic (statistical) metric spaces as a generalisation of the classical triangle inequality for ordinary metric spaces. The next investigations were related with axiomatic of these norms. In this paper, a new t-norm is proposed which is generalisation of th...
متن کاملLogic-Based Roughification
The current chapter is devoted to roughification. In the most general setting, we intend the term roughification to refer to methods/techniques of constructing equivalence/similarity relations adequate for Pawlak-like approximations. Such techniques are fundamental in rough set theory. We propose and investigate novel roughification techniques. We show that using the proposed techniques one can...
متن کاملMatrix Method for Computing Approximations in Variable Consistency Dominance-Based Rough Set Approach
Lower and upper approximations of upward (downward) union of decision classes in Variable Consistency Dominance-Based Rough Set Approach (VC-DRSA) are the basis for extraction of decision rules, so computations of approximations is a necessary step in knowledge representing and reduction based on VCDRSA. In this paper, a matrix-based method for computing lower approximations of upward and downw...
متن کاملGranular Computing on Extensional Functional Dependencies for Information System
Structure of Rough Approximations Based on Molecular Lattices p. 69 Rough Approximations under Level Fuzzy Sets p. 78 Fuzzy-Rough Modus Ponens and Modus Tollens as a Basis for Approximate Reasoning p. 84 Logic and Rough Sets Rough Truth, Consequence, Consistency and Belief Revision p. 95 A Note on Ziarko's Variable Precision Rough Set Model and Nonmonotonic Reasoning p. 103 Fuzzy Reasoning Base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1612.01857 شماره
صفحات -
تاریخ انتشار 2016